Structured Backward Error Analysis of Linearized Structured Polynomial Eigenvalue Problems
نویسندگان
چکیده
We start by introducing a new class of structured matrix polynomials, namely, the class of MA-structured matrix polynomials, to provide a common framework for many classes of structured matrix polynomials that are important in applications: the classes of (skew-)symmetric, (anti-)palindromic, and alternating matrix polynomials. Then, we introduce the families of MAstructured strong block minimal bases pencils and of MA-structured block Kronecker pencils, which are particular examples of block minimal bases pencils recently introduced by Dopico, Lawrence, Pérez and Van Dooren, and show that any MA-structured odd-degree matrix polynomial can be strongly linearized via an MA-structured block Kronecker pencil. Finally, for the classes of (skew-)symmetric, (anti-)palindromic, and alternating odd-degree matrix polynomials, the MAstructured framework allows us to perform a global and structured backward stability analysis of complete structured polynomial eigenproblems, regular or singular, solved by applying to a MAstructured block Kronecker pencil a structurally backward stable algorithm that computes its complete eigenstructure, like the palindromic-QR algorithm or the structured versions of the staircase algorithm. This analysis allows us to identify those MA-structured block Kronecker pencils that yield a computed complete eigenstructure which is the exact one of a slightly perturbed structured matrix polynomial. These pencils include (modulo permutations) the well-known block-tridiagonal and block-antitridiagonal structure-preserving linearizations. Our analysis incorporates structure to the recent (unstructured) backward error analysis performed for block Kronecker linearizations by Dopico, Lawrence, Pérez and Van Dooren, and share with it its key features, namely, it is a rigorous analysis valid for finite perturbations, i.e., it is not a first order analysis, it provides precise bounds, and it is valid simultaneously for a large class of structure-preserving strong linearizations.
منابع مشابه
Structured backward error for palindromic polynomial eigenvalue problems
A detailed structured backward error analysis for four kinds of Palindromic Polynomial Eigenvalue Problems (PPEP) ( d ∑ l=0 Alλ l ) x = 0, Ad−l = εA ⋆ l for l = 0, 1, . . . , ⌊d/2⌋, where ⋆ is one of the two actions: transpose and conjugate transpose, and ε ∈ {±1}. Each of them has its application background with the case ⋆ taking transpose and ε = 1 attracting a great deal of attention lately ...
متن کاملA Chart of Backward Errors for Singly and Doubly Structured Eigenvalue Problems
We present a chart of structured backward errors for approximate eigenpairs of singly and doubly structured eigenvalue problems. We aim to give, wherever possible, formulae that are inexpensive to compute so that they can be used routinely in practice. We identify a number of problems for which the structured backward error is within a factor √ 2 of the unstructured backward error. This paper c...
متن کاملBackward Error Analysis of Polynomial Eigenvalue Problems Solved by Linearization
One of the most frequently used techniques to solve polynomial eigenvalue problems is linearization, in which the polynomial eigenvalue problem is turned into an equivalent linear eigenvalue problem with the same eigenvalues, and with easily recoverable eigenvectors. The eigenvalues and eigenvectors of the linearization are usually computed using a backward stable solver such as the QZ algorith...
متن کاملBackward errors and pseudospectra for structured nonlinear eigenvalue problems
Minimal structured perturbations are constructed such that an approximate eigenpair of a nonlinear eigenvalue problem in homogeneous form is an exact eigenpair of an appropriately perturbed nonlinear matrix function. Structured and unstructured backward errors are compared. These results extend previous results for (structured) matrix polynomials to more general functions. Structured and unstru...
متن کاملStructured Eigenvalue Backward Errors of Matrix Pencils and Polynomials with Palindromic Structures
We derive formulas for the backward error of an approximate eigenvalue of a ∗palindromic matrix polynomial with respect to ∗-palindromic perturbations. Such formulas are also obtained for complex T -palindromic pencils and quadratic polynomials. When the T -palindromic polynomial is real, then we derive the backward error of a real number considered as an approximate eigenvalue of the matrix po...
متن کامل